Automatikos terminų žodynas. – Vilnius: Technika. Vilius Antanas Geleževičius, Angelė Kaulakienė, Stanislovas Marcinkevičius. 2004.
data sequence — duomenų seka statusas T sritis automatika atitikmenys: angl. chain data; chained data; data sequence vok. Datenfolge, f; gekettete Daten; Kette von Daten, f rus. последовательность данных, f; цепочка данных, f pranc. chaîne de données, f; données … Automatikos terminų žodynas
Chained volume series — A Chained volume series is a series of economic data (such as GDP, GNP or similar kinds of data) from successive years, put in real (or constant, ie., inflation and deflation adjusted) terms by computing the production volume for each year in the … Wikipedia
chained — adjective a) bound with chains b) (of data items) linked in a chain … Wiktionary
chain data — duomenų seka statusas T sritis automatika atitikmenys: angl. chain data; chained data; data sequence vok. Datenfolge, f; gekettete Daten; Kette von Daten, f rus. последовательность данных, f; цепочка данных, f pranc. chaîne de données, f; données … Automatikos terminų žodynas
Doubly chained tree — In computer science, a Doubly chained tree is a tree data structure in which each node has two pointers. Typically, each node has one pointer pointing to its child and one pointing at the node to its right. Then the following node will have one… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Heap (data structure) — This article is about the programming data structure. For the dynamic memory area, see Dynamic memory allocation. Example of a complete binary max heap In computer science, a heap is a specialized tree based data structure that satisfies the heap … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Datenfolge — duomenų seka statusas T sritis automatika atitikmenys: angl. chain data; chained data; data sequence vok. Datenfolge, f; gekettete Daten; Kette von Daten, f rus. последовательность данных, f; цепочка данных, f pranc. chaîne de données, f; données … Automatikos terminų žodynas
Kette von Daten — duomenų seka statusas T sritis automatika atitikmenys: angl. chain data; chained data; data sequence vok. Datenfolge, f; gekettete Daten; Kette von Daten, f rus. последовательность данных, f; цепочка данных, f pranc. chaîne de données, f; données … Automatikos terminų žodynas
